Democratic Consensus and the Local Majority Rule
نویسندگان
چکیده
منابع مشابه
Majority Consensus and the Local Majority Rule
we only show one further result that emphasizes our point that understanding LMP is fundamental to understanding any generalization of this process. A simple generalization of the local majority process would allow vertex v to have some resistivity towards color switch. Formally, for a nonnegative integer kv, we de ne a kv-local majority rule for vertex v: ct+1 v = ( ctv if jfw 2 Nv : ctw = ctv...
متن کاملOn the Robustness of Majority Rule and Rule by Consensus†
We show that simple majority rule satisfies the Pareto property, anonymity, neutrality, and (generic) transitivity on a bigger class of preference domains than any other voting rule. If we replace neutrality in the above list of properties with independence of irrelevant alternatives, then the corresponding conclusion holds for unanimity rule (rule by consensus). * Faculty of Economics and Poli...
متن کاملAn Optimal Algorithm for Building the Majority Rule Consensus Tree
A deterministic algorithm for building the majority rule consensus tree of an input collection of conflicting phylogenetic trees with identical leaf labels is presented. Its worst-case running time is O(nk), where n is the size of the leaf label set and k is the number of input phylogenetic trees. This is optimal since the input size is Ω(nk). Experimental results show that the algorithm is fas...
متن کاملMajority-rule reduced consensus trees and their use in bootstrapping.
Bootstrap analyses are usually summarized with majority-rule component consensus trees. This consensus method is based on replicated components and, like all component consensus methods, it is insensitive to other kinds of agreement between trees. Recently developed reduced consensus methods can be used to summarize much additional agreement on hypothesised phylogenetic relationships among mult...
متن کاملConsensus on the Initial Global Majority by Local Majority Polling for a Class of Sparse Graphs
We study the local majority protocol on simple graphs of a given degree sequence, for a certain class of degree sequences. We show that for almost all such graphs, subject to a sufficiently large bias, within time A logd logd n the local majority protocol achieves consensus on the initial global majority with probability 1− n−Ω((logn)ε), where ε > 0 is a constant. A is bounded by a universal co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BRICS Report Series
سال: 2000
ISSN: 1601-5355,0909-0878
DOI: 10.7146/brics.v7i8.20135